#include <cstdio>
#include <cstring>
#define N 2000
#define E 200000
#define typec int // type of cost
const typec inf = 0x3f3f3f3f; // max of cost
struct edge { int x, y, nxt; typec c; } bf[E];
int ne, head[N], cur[N], ps[N], dep[N];
void addedge(int x, int y, typec c)
{ // add an arc(x -> y, c); vertex: 0 ~ n-1;
bf[ne].x = x; bf[ne].y = y; bf[ne].c = c;
bf[ne].nxt = head[x]; head[x] = ne++;
bf[ne].x = y; bf[ne].y = x; bf[ne].c = 0;
bf[ne].nxt = head[y]; head[y] = ne++;
}
typec flow(int n, int s, int t)
{
typec tr, res = 0;
int i, j, k, f, r, top;
while (1) {
memset(dep, -1, n * sizeof(int));
for (f = dep[ps[0] = s] = 0, r = 1; f != r; )
for (i = ps[f++], j = head[i]; j; j = bf[j].nxt)
{
if (bf[j].c && -1 == dep[k = bf[j].y]){
dep[k] = dep[i] + 1; ps[r++] = k;
if (k == t) { f = r; break; }
}
}
if (-1 == dep[t]) break;
memcpy(cur, head, n * sizeof(int));
for (i = s, top = 0; ; ) {
if (i == t) {
for (k = 0, tr = inf; k < top; ++k)
if (bf[ps[k]].c < tr)
tr = bf[ps[f = k]].c;
for (k = 0; k < top; ++k)
bf[ps[k]].c -= tr, bf[ps[k]^1].c += tr;
res += tr; i = bf[ps[top = f]].x;
}
for (j=cur[i]; cur[i]; j = cur[i] = bf[cur[i]].nxt)
if (bf[j].c && dep[i]+1 == dep[bf[j].y]) break;
if (cur[i]) {
ps[top++] = cur[i];
i = bf[cur[i]].y;
}
else {
if (0 == top) break;
dep[i] = -1; i = bf[ps[--top]].x;
}
}
}
return res;
}

int n, m, a[ 31 ][ 31 ];
int f[ 4 ][ 2 ] = { { 1, 0 }, { -1, 0 }, { 0, 1 }, { 0, -1 } };

void init( )
{
    int i, j, k, x, y;
    scanf("%d%d", &n, &m);
    memset( head, 0, sizeof( head ) );
    ne = 2;
    for ( i = 0; i < n; i++ )
        for ( j = 0; j < m; j++ )
            scanf("%d", &a[ i ][ j ]);
    for ( i = 0; i < n; i++ )
        for ( j = 0; j < m; j++ )
        {
            if ( a[ i ][ j ] < 0 ) continue;
            if ( a[ i ][ j ] == 0 )
            {
                addedge( ( i * m + j ) * 2, ( i * m + j ) * 2 + 1, inf );
                addedge( n * m * 2, ( i * m + j ) * 2, inf );
            }
            if ( a[ i ][ j ] > 0 )
                addedge( ( i * m + j ) * 2, ( i * m + j ) * 2 + 1, a[ i ][ j ] );
            for ( k = 0; k < 4; k++ )
            {
                x = i + f[ k ][ 0 ]; y = j + f[ k ][ 1 ];
                if ( x < 0 || x >= n || y < 0 || y >= m ) continue;
                addedge( ( i * m + j ) * 2 + 1, ( x * m + y ) * 2, inf );
            }
            if ( i == 0 || i == n - 1 || j == 0 || j == m - 1 )
                addedge( ( i * m + j ) * 2 + 1, n * m * 2 + 1, inf );
        }
}

int main( )
{
    int t;
    scanf("%d", &t);
    while ( t-- )
    {
        init( );
        printf("%d\n", flow( n * m * 2 + 2, n * m * 2, n * m * 2 + 1 ));
    }
    return 0;
}
